A very large scale neighborhood search algorithm for theq-mode problem
نویسندگان
چکیده
منابع مشابه
Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem
The Quadratic Assignment Problem (QAP) consists of assigning n facilities to n locations so as to minimize the total weighted cost of interactions between facilities. The QAP arises in many diverse settings, is known to be NP-hard, and can be solved to optimality only for fairly small size instances (typically, n ≤ 25). Neighborhood search algorithms are the most popular heuristic algorithms to...
متن کاملVery Large-Scale Neighborhood Search
Neighborhood search algorithms are often the most effective approaches available for solving partitioning problems, a difficult class of combinatorial optimization problems arising in many application domains including vehicle routing, telecommunications network design, parallel machine scheduling, location theory, and clustering. A critical issue in the design of a neighborhood search algorith...
متن کاملA very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
We propose a metaheuristic algorithm for the multi-resource generalizedassignment problem (MRGAP). MRGAP is a generalization of the generalized assignmentproblem, which is one of the representative combinatorial optimization problems knownto be NP-hard. The algorithm features a very large-scale neighborhood search, which is amechanism of conducting the search with complex and po...
متن کاملA Multistage Very Large-Scale Neighborhood Search for the Vehicle Routing Problem with Soft Time Windows
This paper considers the VRP Problem with Soft Time-Windows (VRPSTW), a challenging routing problem due to its combination of hard time windows and a lexicographic objective function minimizing the number of vehicles, the violations of the soft time windows, and the total travel distance. The paper presents a multi-stage, variable neighborhood search algorithm for the VRPSTW, which uses the sam...
متن کاملA survey of very large-scale neighborhood search techniques
Many optimization problems of practical interest are computationally intractable. Therefore, a practical approach for solving such problems is to employ heuristic (approximation) algorithms that can find nearly optimal solutions within a reasonable amount of computation time. An improvement algorithm generally starts with a feasible solution and iteratively tries to obtain a better solution. Ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IIE Transactions
سال: 2007
ISSN: 0740-817X,1545-8830
DOI: 10.1080/07408170701416657